Load-balancing on swapped or OTIS networks
نویسندگان
چکیده
Existing local iterative algorithms for load-balancing are ill-suited to many large-scale interconnection networks. The main reasons are complicated Laplace spectrum computations and flow scheduling strategies. Many large-scale networks are modular and/or hierarchically structured, a prime example being the class of swapped or OTIS networks that have received much attention in recent years. We propose a new local scheme, called DED-X, for load-balancing on homogeneous and heterogeneous swapped/OTIS networks. Our scheme needs spectral information only for themuch smaller basis or factor graph, which is of size O(n) rather than O(n2), and it schedules load flow on intragroup and intergroup links separately. We justify the improvements offered by DED-X schemes over traditional X schemes analytically and verify the advantages of our approach, in terms of efficiency and stability, via simulation. © 2009 Elsevier Inc. All rights reserved.
منابع مشابه
A New Efficient Distributed Load Balancing Algorithm for OTIS-Star Networks
Abstract The OTIS-Star interconnection network is one of the promising interconnection networks for future high speed distributed computing, The OTIS-Star topology consists of both edge and vertex symmetry, it has many attractive topological proprieties based on it is own hierarchical structure nature. Many research efforts have been devoted on this attractive network in literature, but these e...
متن کاملImplementing FEFOM Load Balancing Algorithm on the Enhanced OTIS-n-Cube Topology
The Optical Transpose Interconnection System; OTIS for short; optoelectronic interconnection network architecture is an interesting alternative for future-generation parallel processing systems due to its promising and attractive topological properties. Recently, many enhancements were presented on OTIS topologies including the Enhanced OTIS-nCube interconnection networks. Therefore, performanc...
متن کاملPancyclicity of OTIS (swapped) networks based on properties of the factor graph
a r t i c l e i n f o a b s t r a c t The plausibility of embedding cycles of different lengths in the graphs of a network (known as the pancyclicity property) has important applications in interconnection networks, parallel processing systems, and the implementation of a number of either computational or graph problems such as those used for finding storage schemes of logical data structures, ...
متن کاملBiswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks
In this paper, we propose a new family of communication architectures, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. In particular, if the basis network is a Cayley digraph then so is the resulting BSN. Our biswapped connect...
متن کاملThe Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
A two-level swapped (also known as optical transpose interconnect system, or OTIS) network with n2 nodes is built of n copies of an n-node basis network constituting its clusters. A simple rule for intercluster connectivity (node j in cluster i connected to node i in cluster j for all i = j ) leads to regularity, modularity, packageability, fault tolerance, and algorithmic efficiency of the res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 69 شماره
صفحات -
تاریخ انتشار 2009